149 research outputs found
A Tabu Search algorithm for ground station scheduling problem
(c) 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.Mission planning plays an important role in satellite control systems. Satellites are not autonomously operated in many cases but are controlled by tele-commands transmitted from ground stations. Therefore, mission scheduling is crucial to efficient satellite control systems, especially with increase of number of satellites and more complex missions to be planned. In a general setting, the satellite mission scheduling consists in allocating tasks such as observation, communication, etc. to resources (spacecrafts (SCs), satellites, ground stations). One common version of this problem is that of ground station scheduling, in which the aim is to compute an optimal planning of communications between satellites and operations teams of Ground Station (GS). Because the communication between SCs and GSs can be done during specific window times, this problem can also be seen as a window time scheduling problem. The required communication time is usually quite smaller than the window of visibility of SCs to GSs, however, clashes are produced, making the problem highly constrained. In this paper we present a Tabu Search (TS) algorithm for the problem, while considering several objective functions, namely, windows fitness, clashes fitness, time requirement fitness, and resource usage fitness. The proposed algorithm is evaluated by a set of problem instances of varying size and complexity generated with the STK simulation toolkit. The computational results showed the efficacy of TS for solving the problem on all considered objectives.Peer ReviewedPostprint (author's final draft
Role-shifting threads: Increasing OpenMP malleability to address load imbalance at MPI and OpenMP
This paper presents the evolution of the free agent threads for OpenMP to the new role-shifting threads model and
their integration with the Dynamic Load Balancing (DLB) library. We demonstrate how free agent threads can improve
resource utilization in OpenMP applications with load imbalance in their nested parallel regions. We also demonstrate
how DLB efficiently manages the malleability exposed by the role-shifting threads to address load imbalance issues.
We use three real-world scientific applications, one of them to demonstrate that free agents alone can improve the
OpenMP model without external tools, and two other MPI+OpenMP applications, one of them with a coupling case, to
illustrate the potential of the free agent threads’ malleability with an external resource manager to increase the efficiency
of the system. In addition, we demonstrate that the new implementation is more usable than the former one, letting the
runtime system automatically make decisions that were made by the programmer previously. All software is released
open-source.This work has received funding from the DEEP
Projects, at the European Commission’s FP7, H2020, and EuroHPC
Programmes, under Grant Agreements 287530, 610476, 754304, and
955606. The PCI2021-121958 financed by the Spanish State Research
Agency - Ministry of Science and Innovation. And it also has the support
of the Spanish Ministry of Science and Innovation (Computacion de Altas
Prestaciones VIII: PID2019-107255GB).Peer ReviewedPostprint (author's final draft
Optimization of sonic crystal attenuation properties by ev-MOGA multiobjective evolutionary algorithm
[EN] This paper shows a promising method for acoustic barrier design using a new acoustic material called Sonic Crystals (SCs). The configuration of these SCs is set as a multiobjective optimization problem which is very difficult to solve with conventional optimization techniques. The paper presents a new parallel implementation of a Multiobjective Evolutionary Algorithm called ev-MOGA (also known as (sic)-MOGA) and its application in a complex design problem. ev-MOGA algorithm has been designed to converge towards a reduced, but well distributed, representation of the Pareto Front (solution of the multiobjective optimization problem). The algorithm is presented in detail and its most important properties are discussed. To reduce the ev-MOGA computational cost when.Partially supported by MEC (Spanish Government) and FEDER funds: projects DPI2005-07835, MAT2006-03097 and Generalitat Valenciana (Spain) projects GV06/026, GV/2007/191Herrero Durá, JM.; Garcia-Nieto, S.; Blasco, X.; Romero GarcĂa, V.; Sánchez PĂ©rez, JV.; GarcĂa-Raffi, LM. (2009). Optimization of sonic crystal attenuation properties by ev-MOGA multiobjective evolutionary algorithm. Structural and Multidisciplinary Optimization. 39(2):203-215. https://doi.org/10.1007/s00158-008-0323-7S203215392Alander J (2002) An indexed bibliography of genetic algorithms & pareto and constrainedoptimization. Tech Rep, Dpt of Information Technology, University of VaasaCantĂş-Paz E (1997) A survey of parallel genetic algorithms. Tech Rep 97003, Illimois Genetic Algorithms LaboratotyCervera F, Sanchis L, Sánchez-PĂ©rez JV, MartĂnez-Sala R, Rubio C, Meseguer F, LĂłpez C, Caballero D, Sánchez-Dehesa J (2002) Refractive acoustic devices for airborne sound. Phys Rev Lett 88:0239021–0239024Chen Y, Ye Z (2001) Theoretical analysis of stop bands in two-dimensional periodic scattering arrays. Phys Rev E 64:036616Coello C, Toscano G, Mezura E (2005) Information processing with evolutionary algorithms. In: Grana M, Duro R, d’Anjou A, Wang PP (eds) Information processing with evolutionary algorithms: from industrial applicationsto academic speculations. Springer, New York, pp 213–231Coello C, Veldhuizen D, Lamont G (2002) Evolutionary algorithms for solving multi-objective problems. Kluwer, DordrechtDeb K (2007) Current trends in evolutionary multi-objective optimization. Int J Simul Multidiscipl Des Optim 1:1–8Eshelman LJ (1991) The chc adaptive search algorithm: how to have safe search when engaging in nontraditional genetic recombination. In: Proceedings of the first workshop on foundations of genetic algorithms. Morgan Kaufmann, San Francisco, pp 265–283Fonseca C, (1995) Multiobjective genetic algorithms with application to control engineeringproblems. PhD thesis, Dpt of Automatic Control and Systems Engineering, University of SheffieldFuster E, Romero-GarcĂa V, GarcĂa-Raffi LM, Sánchez-PĂ©rez EA, Sopena M, Sánchez-PĂ©rez JV (2006) A phenomenological model for sonic crystals based on artificial neural networks. J Acoust Soc Am 120(2):1–6GarcĂa-Pablos D, Sigalas M, de Espinosa FM, Torres M, Kafesaki M, GarcĂa, N (2000) Theory and experiments on elastic band gaps. Phys Rev Lett 84:4349–4352Gazonas GA, Weile DS, Wildman R, Mohan A (2006) Genetic algorithm optimization of phononic bandgap structures. Int J Solids Struct 43:5851–5866Hakkansson A, Cervera F, Sánchez-Dehesa J (2005) Sound focusing by flat acoustic lenses without negative refraction. Appl Phys Lett 86:0541021–0541023Herrero J, Blasco X, MartĂnez M, Ramos C, Sanchis J (2007) Non-linear robust identification of a greenhouse model using multi-objective evolutionary algorithms. Biosyst Eng 98(3):335–346Herrero JM (2006) Non-linear robust identification using evolutionary algorithms. PhD thesis, Universidad PolitĂ©cnica de Valencia, ValenciaHussein MI, Hamza K, Hulbert GM, Saitou K (2007) Optimal synthesis of 2d phononic crystals for broadband frequency isolation. Waves Random Complex Media 17(4):491–510Hussein MI, Hamza K, Hulbert GM, Scott RA, Saitou K (2006) Multiobjective evolutionary optimization of periodic layered materials for desired wave dispersion characteristics. Struct Multidisc Optim 31:60–75Kafesaki M, Economou E (1999) Multiple scattering theory for three-dimensional periodic acoustic composites. Phys Rev B 60:11993Kohn W, Rostoker N (1954) Solution of the schrodinger equation in periodic lattices with an aplication to metallic lithium. Phys Rev 94:1111Korringa J (1947) On th calculation of the energy of a bloch wave in a metal. Physica XIII:392Kushwaha M (1997) Stop-bands for periodic metallic rods: Sculptures that can filter the noise. Appl Phys Lett 70:3218–3220Laumanns M, Thiele L, Deb K, Zitzler E (2002) Combining convergence and diversity in evolutionary multi-objective optimization. Evol Comput 10(3):263–282MartĂnez-Sala R, Sancho J, Sánchez J, GĂłmez V, Llinares J, Meseguer F (1995) Sound attenuation by sculpture. Nature 378:241Miettinen KM (1998) Nonlinear multiobjective optimization. Kluwer, DordrechtMishra S, Deb K, Mohan M (2005) Evaluating the ε-domination based multi-objective evolutionary algorithm for a quick computation of pareto-optimal solutions. Evol Comput 13(4):501–526Romero-GarcĂa V, Fuster E, GarcĂa-Raffi LM, Sánchez-PĂ©rez EA, Sopena M, Llinares J, Sánchez-PĂ©rez JV (2006) Band gap creation using quasiordered structures based on sonic crystals. Appl Phys Lett 88:1741041–17410413Sánchez-PĂ©rez JV, Caballero D, MartĂnez-Sala R, Rubio C, Sánchez-Dehesa J, Meseguer F, Llinares J, Gálvez F (1998) Sound attenuation by a two-dimensional array of rigid cylinders. Phys Rev Lett 80:5325–5328Sánchez-PĂ©rez JV, Rubio C, MartĂnez-Sala R, Sánchez-Grandia R, GĂłmez V (2002) Acoustic barriers based on periodic arrays of scatterers. Appl Phys Lett 27:5240–5242Sanchis L, Hakkansson A, LĂłpez-ZanĂłn D, Bravo-Abad J, Sánchez-Dehesa J (2004) Integrated optical devices design by genetic algorithm. Appl Phys Lett 84:4460–4462Shen M, Cao W (2001) Acoustic band-gap engineering using finite-size layered structures of multiple periodicity. Appl Phys Lett 75:3713–3715Sigalas M, Economou E (1992) Elastic and acoustic wave band structure. J Sound Vib 158:377Zitzler E (1999) Evolutionary algorithms for multiobjective optimization: Methods and applications. Ph.D. thesis, Swiss Federal Institute of Technology Zuric
An overview of nanomedicines for neuron targeting
Medical treatments of neuron-related disorders are limited due to the difficulty of targeting brain cells. Major drawbacks are the presence of the blood-brain barrier and the lack of specificity of the drugs for the diseased cells. Nanomedicine-based approaches provide promising opportunities for overcoming these limitations. Although many previous reviews are focused on brain targeting with nanomedicines in general, none of those are concerned explicitly on the neurons, while targeting neuronal cells in central nervous diseases is now one of the biggest challenges in nanomedicine and neuroscience. We review the most relevant advances in nanomedicine design and strategies for neuronal drug delivery that might successfully bridge the gap between laboratory and bedside treatment in neurology
The importance of being dead: cell death mechanisms assessment in anti-sarcoma therapy
Cell death can occur through different mechanisms, defined by their nature and physiological implications. Correct assessment of cell death is crucial for cancer therapy success. Sarcomas are a large and diverse group of neoplasias from mesenchymal origin. Among cell death types, apoptosis is by far the most studied in sarcomas. Albeit very promising in other fields, regulated necrosis and other cell death circumstances (as so-called "autophagic cell death" or "mitotic catastrophe") have not been yet properly addressed in sarcomas. Cell death is usually quantified in sarcomas by unspecific assays and in most cases the precise sequence of events remains poorly characterized. In this review, our main objective is to put into context the most recent sarcoma cell death findings in the more general landscape of different cell death modalities
Multiobjective evolutionary algorithms for multivariable PI controller design
A multiobjective optimisation engineering design (MOED) methodology for PI controller tuning in multivariable
processes is presented. The MOED procedure is a natural approach for facing multiobjective
problems where several requirements and specifications need to be fulfilled. An algorithm based on
the differential evolution technique and spherical pruning is used for this purpose. To evaluate the methodology,
a multivariable control benchmark is used. The obtained results validate the MOED procedure as
a practical and useful technique for parametric controller tuning in multivariable processes.This work was partially supported by the FPI-2010/19 grant and the project PAID-06-11 from the Universitat Politecnica de Valencia and the projects DPI2008-02133, TIN2011-28082 and ENE2011-25900 from the Spanish Ministry of Science and Innovation.Reynoso Meza, G.; SanchĂs Saez, J.; Blasco Ferragud, FX.; Herrero Durá, JM. (2012). Multiobjective evolutionary algorithms for multivariable PI controller design. Expert Systems with Applications. 39(9):7895-7907. https://doi.org/10.1016/j.eswa.2012.01.111S7895790739
EvaluaciĂłn del Trabajo de Fin de Grado
Los Proyectos de Fin de Carrera (PFC) se han evaluado tradicionalmente a partir de una memoria y de una presentaciĂłn pĂşblica. Esta evaluaciĂłn, en general, la realiza un tribunal formado por varios profesores, que juzga de forma integral el proyecto a partir de la documentaciĂłn entregada y de su presentaciĂłn pĂşblica. Para poner la nota final los centros no disponen, en general, de unos criterios claros y precisos, por lo que cada tribunal usa su propia experiencia previa para decidir la nota de cada proyecto. Los Trabajos de Fin de Grado (TFG) substituyen en los nuevos planes de estudios de las ingenierĂas a los antiguos PFC. La evaluaciĂłn de los TFG debe considerar, de forma explĂcita, tanto las competencias especĂficas como las genĂ©ricas, y es necesario que existan criterios claros sobre la forma de evaluarlas. Para avanzar en este sentido, el Ministerio de Ciencia e InnovaciĂłn y la Agencia para la Calidad del Sistema Universitario de Catalunya financiaron en 2008 y 2009 el proyecto “GuĂa para la evaluaciĂłn de competencias en los Trabajos de Fin de Grado y de Máster en las IngenierĂas”. Esta guĂa es, en realidad, una guĂa para ayudar a que cada centro/titulaciĂłn defina su propio procedimiento de evaluaciĂłn del TFG. En este trabajo se presenta una implementaciĂłn de las propuestas contenidas en la guĂa y se define una metodologĂa para evaluar los TFG a partir de las competencias que se trabajan en la titulaciĂłn de Grado en IngenierĂa Informática de la Facultat d’InformĂ tica de Barcelona. La metodologĂa puede ser fácilmente replicada o adaptada para otros centros y otras titulaciones, lo que puede facilitar la realizaciĂłn de su propia guĂa de evaluaciĂłn de los TFG.Final Degree Projects (FDP) have traditionally been evaluated from a project report and a public presentation. This assessment is generally performed by a panel of several teachers who judg comprehensively the project from the documentation provided and analyze the public presentation. In general, schools do not have clear and precise criteria to set the final grade, as each panel uses its own previous experience to decide the mark of each project. The Bachelor Degree Thesis (BDT) replaced the former FDP in the new engineering curricula. Evaluation of FDP should consider explicitly both specific and professional skills, and clear criteria on how to assess competencies is required. To advance in this issue, the Ministry of Science and Innovation and the Quality Agency for the University System in Catalonia funded in 2008 and 2009 the project "GuĂa para la evaluaciĂłn de competencias en los Trabajos de Fin de Grado y de Master en las IngenierĂas". This guide is actually a guide to help each school / degree to define its own procedure for assessing the BDT. This paper presents an implementation of the suggestions contained in the guide and defines a methodology for assessing the BDT considering the professional skills trained in the Computer Engineering Degree from the Barcelona School of Informatics. The methodology can be easily replicated or adapted for other centres and degrees, which can facilitate the realization of its own guidance for the BDT evaluation
La COVID-19 a Catalunya 2020-2021
Coronavirus SARS-CoV-2; COVID-19; 2019-nCoV; Salut públicaCoronavirus SARS-CoV-2; COVID-19; 2019-nCoV; Salud públicaSARS-CoV-2 coronavirus; COVID-19; 2019-nCoV; Public healthPublicació que recull aportacions d’algunes de les persones que han participat, durant els anys 2020 i 2021, en la gestió de la crisi sanità ria COVID-19
The Bace1 product sAPPβ induces ER stress and inflammation and impairs insulin signaling
Objective -secretase/-site amyloid precursor protein (APP)-cleaving enzyme 1 (BACE1) is a key enzyme involved in Alzheimer's disease that has recently been implicated in insulin-independent glucose uptake in myotubes. However, it is presently unknown whether BACE1 and the product of its activity, soluble APPsAPPcontribute to lipid-induced inflammation and insulin resistance in skeletal muscle cells. Materials/Methods Studies were conducted in mouse C2C12 myotubes, skeletal muscle from Bace1-/-mice and mice treated with sAPP and adipose tissue and plasma from obese and type 2 diabetic patients. Results We show that BACE1 inhibition or knockdown attenuates palmitate-induced endoplasmic reticulum (ER) stress, inflammation, and insulin resistance and prevents the reduction in Peroxisome Proliferator- Activated Receptor Co-activator 1 (PGC-1) and fatty acid oxidation caused by palmitate in myotubes. The effects of palmitate on ER stress, inflammation, insulin resistance, PGC-1 down-regulation, and fatty acid oxidation were mimicked by soluble APP in vitro. BACE1 expression was increased in subcutaneous adipose tissue of obese and type 2 diabetic patients and this was accompanied by a decrease in PGC-1 mRNA levels and by an increase in sAPPplasma levels of obese type 2 diabetic patients compared to obese non-diabetic subjects. Acute sAPP administration to mice reduced PGC-1 levels and increased inflammation in skeletal muscle and decreased insulin sensitivity. Conclusions Collectively, these findings indicate that the BACE1 product sAPP is a key determinant in ER stress, inflammation and insulin resistance in skeletal muscle and gluconeogenesis in liver
- …